A revised Moore bound for mixed graphs
نویسندگان
چکیده
منابع مشابه
A revised Moore bound for mixed graphs
The degree-diameter problem seeks to find the maximum possible order of a graph with a given (maximum) degree and diameter. It is known that graphs attaining the maximum possible value (the Moore bound) are extremely rare, but much activity is focussed on finding new examples of graphs or families of graph with orders approaching the bound as closely as possible. There has been recent interest ...
متن کاملA Moore-like bound for mixed abelian Cayley graphs
We give an upper bound for the number of vertices in mixed abelian Cayley graphs with given degree and diameter.
متن کاملThe Moore Bound for Irregular Graphs
What is the largest number of edges in a graph of order n and girth g? For dregular graphs, essentially the best known answer is provided by the Moore bound. This result is extended here to cover irregular graphs as well, yielding an affirmative answer to an old open problem ([4] p.163, problem 10). What is the maximal number of edges in a graph with n vertices and girth g? Put differently, wha...
متن کاملApproaching the mixed Moore bound for diameter two by Cayley graphs
In a mixed (Δ, d)-regular graph, every vertex is incident with Δ ≥ 1 undirected edges and there are d ≥ 1 directed edges entering and leaving each vertex. If such a mixed graph has diameter 2, then its order cannot exceed (Δ+ d) + d+1. This quantity generalizes the Moore bounds for diameter 2 in the case of undirected graphs (when d = 0) and digraphs (when Δ = 0). For every d such that d − 1 is...
متن کاملNew mixed Moore graphs and directed strongly regular graphs
A directed strongly regular graph with parameters (n, k, t, λ, μ) is a k-regular directed graph with n vertices satisfying that the number of walks of length 2 from a vertex x to a vertex y is t if x = y, λ if there is an edge directed from x to y and μ otherwise. If λ = 0 and μ = 1 then we say that it is a mixed Moore graph. It is known that there are unique mixed Moore graphs with parameters ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2016
ISSN: 0012-365X
DOI: 10.1016/j.disc.2016.03.005